#include<bits/stdc++.h>
using namespace std;
int ans,n,a[100005],m[100005];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    if(n==1){
        cout<<1<<endl;
        return 0;
    }
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    int y=1,x=a[0];
    for(int i=0;i<n;i++){
        if(a[i]==x)ans++;
        else{
            x=a[i];
            m[y]=ans;
            y++;
            ans=0;
        }
    }
    ans=m[1];
    for(int i=2;i<=y;i++){
        if(m[i]>=m[i-1])ans+=m[i]-m[i-1];
    }
    cout<<ans<<endl;
    return 0;
}
